//https://leetcode.cn/contest/weekly-contest-381/problems/minimum-number-of-pushes-to-type-word-i/


class Solution {
public:
    int minimumPushes(string word) {
        int n = word.size();
        if(n <= 8)
        {
            return n;
        }
        else if(n <= 16)
        {
            return 8 + 2*(n - 8);
        }
        else if(n <= 24)
        {
            return 24 + 3*(n - 16); 
        }
        else
        {
            return 48 + 4*(n - 24);
        }
    }
};